Using the Perceptron Algorithm to Find Consistent Hypotheses
نویسندگان
چکیده
منابع مشابه
Using the Perceptron Algorithm to Find Consistent Hypotheses
The perceptron learning algorithm yields quite naturally an algorithm for finding a linearly separable boolean function consistent with a sample of such a function. Using the idea of a specifying sample, we give a simple proof that this algorithm is not efficient, in general. A boolean function t defined on {0, 1} is linearly separable if there are α ∈ R and θ ∈ R such that t(x) = { 1 if 〈α, x〉...
متن کاملThe perceptron algorithm
The perceptron algorithm is an algorithm for supervised linear classification. Restricting ourselves to considering only binary classification, the most basic linear classifier is a hyperplane separating the two classes of our dataset. More formally, assume that we have a normal vector w ∈ RD defining a hyperplane. Binary classification is typically performed by defining a function f , such that
متن کاملThe Perceptron Algorithm:
A novel algorithm for tunable compression to within the precision of reproduction targets, or storage, is proposed. The new algorithm is termed the “Perceptron Algorithm”, which utilises simple existing concepts in a novel way, has multiple immediate commercial application aspects as well as it opens up a multitude of fronts in computational science and technology. The aims of this paper are to...
متن کاملUsing Niche Genetic Algorithm to Find Fuzzy Rules
The genetic algorithm has been widely used in many fields as an easy robust global search and optimization method. This paper introduces a new approach to find fuzzy rules using niche genetic algorithms with elitist migrating operator. It uses binary coding scheme. In order to make search results stable, elitist migrating operator reserves good individuals into an elitist sub-population. The si...
متن کاملOnline Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Point Machine) algorithm, which finds a rule that correctly ranks a given training sequence of instance and target rank pairs. PRank maintains a weight vector and a set of thresholds to define a ranking rule that maps each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 1993
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548300000778